- 01. Binary Search
- 02. Efficiency of Binary Search
- 03. Binary Search Practice
- 04. Binary Search Variation
- 05. Binary search: First and last indexes
- 06. Tries
- 07. Heaps
- 08. Heapify
- 09. Heap Implementation
- 10. Heaps Exercise
- 11. Self-Balancing Tree
- 12. Red-Black Tree Insertion
- 13. Tree Rotations
- 14. Build a Red-Black Tree
- 15. Interlude